The minimum perfect matching in pseudo-dimension 0 < q < 1

Mean field matching and TSP in pseudo - dimension 1

Recent work on optimization problems in random link models has verified several conjectures originating in statistical physics and the replica and cavity methods. In particular the numerical value 2.0415 for the limit length of a traveling salesman tour in a complete graph with uniform [0, 1] edge lengths has been established. In this paper we show that the crucial integral equation obtained wi...

Perfect Bipartite Matching in Pseudo-Deterministic RNC

In this paper we present a pseudo-deterministic RNC algorithm for finding perfect matchings in bipartite graphs. Specifically, our algorithm is a randomized parallel algorithm which uses poly(n) processors, poly(log n) depth, poly(log n) random bits, and outputs for each bipartite input graph a unique perfect matching with high probability. That is, it returns the same matching for almost all r...

Perfect 0 , + 1 Matrices *

Perfect graphs and perfect 0,l matrices are well studied in the literature. Here we introduce perfect 0, f 1 matrices. Our main result is a characterization of these matrices in terms of a family of perfect 0,l matrices. 0 Elsevim Science Inc., 1997 * This work was supported in part by NSF grants DMI-9424348 and DMS-9509581, and by ONR grant NOOO14-89-J-1063. LINEAR ALGEBRA AND ITS APPLZCATIONS...

Srikumar 1 Perfect Matching and Matching Polytopes

Minimum entangled state dimension required for pseudo-telepathy

Pseudo-telepathy provides an intuitive way of looking at Bell’s inequalities, in which it is often obvious that feats achievable by use of quantum entanglement would be classically impossible. A two-player pseudo-telepathy game proceeds as follows: Alice and Bob are individually asked a question and they must provide an answer. They are not allowed any form of communication once the questions a...